Hexagonal 2-complexes Have a Strongly Convex Metric
نویسنده
چکیده
We give two distinct proofs for the fact that any finite simply connected hexagonal 2-complex has a strongly convex metric. In our first proof we show that these complexes are CAT(0) spaces, while the second proof makes use of the fact that finite, simply connected hexagonal 2-complexes are collapsible. Both proofs rely on the fact that hexagonal 2-complexes have the 12-property.
منابع مشابه
Cubical 2-complexes with the 8-property Admit a Strongly Convex Metric
We study metric conditions implied by a combinatorial curvature condition on a finite cubical 2-complex. Our main result is that any finite, simply connected, cubical 2-complex with the 8-property, admits a strongly convex metric. 2000 Mathematics Subject Classification: 53C21.
متن کاملInfinite Random Geometric Graphs from the Hexagonal Metric
We consider countably infinite random geometric graphs, whose vertices are points in R, and edges are added independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. Assume that the vertex set is randomly chosen and dense in R. We address the basic question: for what metrics is there a unique isomorphism type for graphs resulting from this...
متن کاملConvexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملOrthogonal metric space and convex contractions
In this paper, generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions. Also, we show that there are examples which show that our main theorems are genuine generalizations of Theorem 3.1 and 3.2 of [M.A. Miandaragh, M. Postolache and S. Rezapour, {it Approximate fixed points of generalized convex contractions}, Fixed Poi...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011